Three-Dimensional Projection Pursuit
نویسنده
چکیده
The development and usage of a three-dimensional projection pursuit software package is discussed. The well-established Jones and Sibson moments index is chosen as a computationally efficient projection index to extend to 3D. Computer algebraic methods are extensively employed to handle the long and complex formulae that constitute the index and are explained in detail. A discussion of important practical issues such as interpreting projection solutions, dealing with outliers and optimization techniques completes the description of the development of the index. The article presents a tutorial introduction to freely available software that performs 3D projection pursuit. The tutorial uses the well-known Lubischew beetle data and an artificial tetrahedral data set to demonstrate how 3D projection pursuit can produce better clusters than those obtained by principal components analysis. The preferred method of using the software is via software functions from the computer package S. This not only provides the statistical user with a familiar interface but also permits the provision of full help and extensive graphics which contribute to a better understanding of the user’s data. The 3D index was initially developed to find interesting linear combinations of spectral bands in a multispectral image. The main example shows how 3D projection pursuit can successfully combine bands to discover alternative clusters to those produced by, say, principal components.
منابع مشابه
انجام یک مرحله پیش پردازش قبل از مرحله استخراج ویژگی در طبقه بندی داده های تصاویر ابر طیفی
Hyperspectral data potentially contain more information than multispectral data because of their higher spectral resolution. However, the stochastic data analysis approaches that have been successfully applied to multispectral data are not as effective for hyperspectral data as well. Various investigations indicate that the key problem that causes poor performance in the stochastic approaches t...
متن کاملMultimodality Exploration in Training an Unsupervised Projection Pursuit Neural Network
Graphical inspection of multimodality is demonstrated using unsupervised lateral-inhibition neural networks. Three projection pursuit indices are compared on low dimensional simulated and real-world data: principal components 22], Legendre polynomial 6] and projection pursuit network 16].
متن کاملCombining Exploratory Projection Pursuit and Projection Pursuit Regression with Application to Neural Networks
Parameter estimation becomes difficult in high-dimensional spaces due to the increasing sparseness of the data. Therefore, when a low-dimensional representation is embedded in the data, dimensionality reduction methods become useful. One such method-projection pursuit regression (Friedman and Stuetzle 1981 (PPR)-is capable of performing dimensionality reduction by composition, namely, it constr...
متن کاملProjection Pursuit the Two Basic Elements of Projection Pursuit Are: a Pp Index and a Pp Algorithm. A
Many data sets are high dimensional. It has been a common practice to use lower dimensional linear projections of the data for visual inspection. The lower dimension is usually 1 or 2 (or maybe 3). More precisely, if X 1 ; : : :; X n 2 IR p are p-dimensional data, then a k (< p)-dimensional linear projection is Z 1 ; : : : ; Z n 2 IR k where Z i = T X i for some p k matrix such that T = I k , t...
متن کاملProjection Pursuit for Exploratory Supervised Classification
In high-dimensional data, one often seeks a few interesting low-dimensional projections that reveal important features of the data. Projection pursuit is a procedure for searching high-dimensional data for interesting low-dimensional projections via the optimization of a criterion function called the projection pursuit index. Very few projection pursuit indices incorporate class or group inform...
متن کامل